Accurate and Efficient Similarity Search on 3D Objects Using Point Sampling, Redundancy, and Proportionality

نویسندگان

  • Johannes Aßfalg
  • Hans-Peter Kriegel
  • Peer Kröger
  • Marco Pötke
چکیده

With fast evolving resources for 3D objects such as the Protein Data Bank (PDB) or theWorld Wide Web, new techniques, so-called similarity models to efficiently and effectively search for these 3D objects become indispensible. Invariances w.r.t. specific geometric transformations such as scaling, translation, and rotation are important features of similarity models. In this paper, we focus on rotation invariance. We first propose a new method of representing objects more accurately in the context of rotation invariance than the well-known voxelization technique.In addition, we extend existing feature-based similarity models by proposing a new spherical partitioning of the data objects based on proportionality and redundancy, and generalizing an existing method for feature extraction. A broad experimental evaluation compares our method with existing methods in terms of accuracy and efficiency. In particular, we experimentally confirm that our point sampling method is better suited to represent 3D objects in the context of rotation invariance than voxelized representations. In addition, we empirically show that our new similarity model significantly outperfoms competitive rotation invariant models in terms of accuracy as well as efficiency.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

مدل‌سازی روابط توپولوژیک سه بعدی فازی در محیط GIS

Nowadays, geospatial information systems (GIS) are widely used to solve different spatial problems based on various types of fundamental data: spatial, temporal, attribute and topological relations. Topological relations are the most important part of GIS which distinguish it from the other kinds of information technologies. One of the important mechanisms for representing topological relations...

متن کامل

Range-Efficient Consistent Sampling and Locality-Sensitive Hashing for Polygons

Locality-sensitive hashing (LSH) is a fundamental technique for similarity search and similarity estimation in high-dimensional spaces. The basic idea is that similar objects should produce hash collisions with probability significantly larger than objects with low similarity. We consider LSH for objects that can be represented as point sets in either one or two dimensions. To make the point se...

متن کامل

An improved opposition-based Crow Search Algorithm for Data Clustering

Data clustering is an ideal way of working with a huge amount of data and looking for a structure in the dataset. In other words, clustering is the classification of the same data; the similarity among the data in a cluster is maximum and the similarity among the data in the different clusters is minimal. The innovation of this paper is a clustering method based on the Crow Search Algorithm (CS...

متن کامل

کاربرد چاپگر سه‌بعدی در بازسازی اشیای تاریخی شیشه‌ای

Three-dimensional tools are widely used for various purposes, particularly Three- dimensional printers which play a great role in simplification and acceleration of phases in production process for various fields ranging from medicine to industry. Due to the problems related to the reconstruction of missing parts in restoration of historic glass objects in the methods of molding, casting and f...

متن کامل

3D Modelling of Under Ground Burried Objects Based on Ground Penetration Radar

There is a growing demand for mapping and 3D modelling of buried objects such as pipelines, agricultural hetitage, landmines and other buried objects. Usually, large scale and high resolution maps from these objects are needed. Manually map generation and modeling of these objects are cost and time consuming and is dependent on lots of resources. Therefore, automating the subsurface mapping and...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005